Back to course home
0% completed
Vote For New Content
Tree Breadth First Search (BFS) Pattern (easy)
Introduction to Tree Breadth First Search Pattern
Sum of Nodes with Even-Valued Grandparent (medium)
Solution: Sum of Nodes with Even-Valued Grandparent
All Nodes Distance K in Binary Tree (medium)
Solution: All Nodes Distance K in Binary Tree
Level Order Successor (easy)
Solution: Level Order Successor
Connect Level Order Siblings (medium)
Solution: Connect Level Order Siblings
Connect All Level Order Siblings (medium)
Solution: Connect All Level Order Siblings
Tree Depth First Search (DFS) Pattern (medium)
Introduction to Tree Depth First Search Pattern
Binary Tree Path Sum (easy)
Solution: Binary Tree Path Sum
Count Good Nodes in Binary Tree (medium)
Solution: Count Good Nodes in Binary Tree
Path Sum III (medium)
Solution: Path Sum III
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Maximum Difference Between Node and Ancestor (medium)
Solution: Maximum Difference Between Node and Ancestor
Root to Leaf Path Pattern (medium)
Introduction to Root to Leaf Path Pattern
Binary Tree Paths (easy)
Solution: Binary Tree Paths
Sum of Root To Leaf Binary Numbers (easy)
Solution: Sum of Root To Leaf Binary Numbers
Insufficient Nodes in Root to Leaf Paths (medium)
Solution: Insufficient Nodes in Root to Leaf Paths
Smallest String Starting From Leaf (medium)
Solution: Smallest String Starting From Leaf
Pseudo-Palindromic Paths in a Binary Tree (medium)
Solution: Pseudo-Palindromic Paths in a Binary Tree
All Paths for a Sum (medium)
Solution: All Paths for a Sum
Sum of Path Numbers (medium)
Solution: Sum of Path Numbers
Path With Given Sequence (medium)
Solution: Path With Given Sequence
Count Paths for a Sum (medium)
Solution: Count Paths for a Sum
Leaf Processing Pattern (medium)
Introduction to Leaf Processing Pattern
Sum of Left Leaves (easy)
Solution: Sum of Left Leaves
Leaf-Similar Trees (easy)
Solution: Leaf-Similar Trees
Check if all leaves are at same level (medium)
Solution: Check if all leaves are at same level
Delete Leaves With a Given Value (medium)
Solution: Delete Leaves With a Given Value
Deepest Leaves Sum (medium)
Solution: Deepest Leaves Sum
Tree View Pattern (medium)
Introduction to Tree View Pattern
Right View of a Binary Tree (medium)
Solution: Right View of a Binary Tree
Top View Of the Binary Tree (medium)
Solution: Top View Of the Binary Tree
Bottom View Of the Binary Tree (medium)
Solution: Bottom View Of the Binary Tree
Boundary of Binary Tree (medium)
Solution: Boundary of Binary Tree
Comparison of Two Trees Pattern (medium)
Introduction to Comparison of Two Trees Pattern
Symmetric Tree (easy)
Solution: Symmetric Tree
Mirror Image Trees (medium)
Solution: Mirror Image Trees
Subtree of Another Tree (easy)
Solution: Subtree of Another Tree
Isomorphic Trees (medium)
Solution: Isomorphic Trees
Serialize and Deserialize Tree Pattern (hard)
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Balanced Binary Tree (easy)
Problem Statement
Determine if a binary tree is height-balanced.
A binary tree is considered height-balanced if, for each node, the difference in height between its left and right subtrees is no more than one.
Examples:
- Input:
3
/ \
9 20
/ \
15 7
- Expected Output: true
- Justification: Every node in the tree has a left and right subtree depth difference of either 0 or 1.
- Input:
1
/ \
2 2
/ \ / \
3 3 3 3
/ \ / \
4 4 4 4
- Expected Output: true
- Justification: Each node in the tree has a left and right subtree depth difference of either 0 or 1.
- Input:
1
/ \
2 5
/
3
/
4
- Expected Output: false
- Justification: The root node has a left subtree depth of 3 and right subtree depth of 1. The difference (3 - 1 = 2) exceeds 1, hence the tree is not balanced.
Constraints:
- The number of nodes in the tree is in the range
[0, 5000]. - -104 <= Node.val <= 104
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: Minimum Depth of a Binary Tree
Solution: Balanced Binary Tree
Mark as Completed
On this page
Problem Statement
Try it yourself